2 1 O ct 2 00 7 COMBINATORIAL ALEXANDER DUALITY — A SHORT AND ELEMENTARY PROOF
نویسنده
چکیده
Let X be a simplicial complex with the ground set V . Define its Alexander dual as a simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V |−i−3)th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof.
منابع مشابه
5 O ct 2 00 7 COMBINATORIAL ALEXANDER DUALITY — A SHORT AND ELEMENTARY PROOF
Let X be a simplicial complex with the ground set V . Define its Alexander dual as a simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V |−i−3)th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof.
متن کاملCombinatorial Alexander Duality — a Short and Elementary Proof
Let X be a simplicial complex with ground set V . Define its Alexander dual as the simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V | − i − 3)-th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof from first principles, accessible to the non-ex...
متن کاملNote: Combinatorial Alexander Duality - A Short and Elementary Proof
Let X be a simplicial complex with ground set V . Define its Alexander dual as the simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V | − i − 3)-th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof from first principles, accessible to the non-ex...
متن کاملA Short Proof of the Non-Existence of Certain Cryptographic Functions
Several criteria have been proposed as desirable for binary cryptographic functions. Three important ones are balance, correlation-immunity and higher order strict avalanche criterion. Lloyd 7] has shown that there are no balanced, uncorrelated functions which satisfy the strict avalanche criterion of order n ? 2. In this note we give a short proof of this result using elementary combinatorial ...
متن کاملA Short Proof of the Random Ramsey Theorem
In this paper we give a short proof of the Random Ramsey Theorem of Rödl and Ruciński: for any graph F which contains a cycle and r ≥ 2, there exist constants c, C > 0 such that P[Gn,p → (F )r] = { 1− o(1), p ≥ Cn−1/m2(F ) o(1), p ≤ cn−1/m2(F , where m2(F ) = maxJ⊆F,vJ≥2 eJ−1 vJ−2 . The proof of the 1-statement is based on the recent beautiful hypergraph container theorems by Saxton/Thomason an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008